<!DOCTYPE html>
<html lang="zh-CN">
<head>
  <meta charset="UTF-8">
<meta name="viewport" content="width=device-width">
<meta name="theme-color" content="#222"><meta name="generator" content="Hexo 7.3.0">

  <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
  <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32.ico">
  <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16.ico">
  <link rel="mask-icon" href="/images/logo.svg" color="#222">

<link rel="stylesheet" href="/css/main.css">



<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.5.1/css/all.min.css" integrity="sha256-wiz7ZSCn/btzhjKDQBms9Hx4sSeUYsDrTLg7roPstac=" crossorigin="anonymous">
  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.1.1/animate.min.css" integrity="sha256-PR7ttpcvz8qrF57fur/yAx1qXMFJeJFiA6pSzWi0OIE=" crossorigin="anonymous">
  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/5.0.28/fancybox/fancybox.css" integrity="sha256-6cQIC71/iBIYXFK+0RHAvwmjwWzkWd+r7v/BX3/vZDc=" crossorigin="anonymous">
  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/pace/1.2.4/themes/green/pace-theme-minimal.css">
  <script src="https://cdnjs.cloudflare.com/ajax/libs/pace/1.2.4/pace.min.js" integrity="sha256-gqd7YTjg/BtfqWSwsJOvndl0Bxc8gFImLEkXQT8+qj0=" crossorigin="anonymous"></script>

<script class="next-config" data-name="main" type="application/json">{"hostname":"sumumm.github.io","root":"/","images":"/images","scheme":"Gemini","darkmode":false,"version":"8.19.2","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12},"copycode":{"enable":true,"style":"mac"},"fold":{"enable":true,"height":300},"bookmark":{"enable":false,"color":"#222","save":"auto"},"mediumzoom":false,"lazyload":true,"pangu":false,"comments":{"style":"tabs","active":null,"storage":true,"lazyload":false,"nav":null},"stickytabs":false,"motion":{"enable":true,"async":true,"transition":{"menu_item":"fadeInDown","post_block":"fadeIn","post_header":"fadeInDown","post_body":"fadeInDown","coll_header":"fadeInLeft","sidebar":"fadeInUp"}},"i18n":{"placeholder":"搜索...","empty":"没有找到任何搜索结果：${query}","hits_time":"找到 ${hits} 个搜索结果（用时 ${time} 毫秒）","hits":"找到 ${hits} 个搜索结果"},"path":"/search.xml","localsearch":{"enable":true,"trigger":"auto","top_n_per_article":1,"unescape":false,"preload":false}}</script><script src="/js/config.js"></script>

    <meta name="description" content="本文主要是数据结构——顺序表的一些基础操作，如增删改查等的相关笔记，若笔记中有错误或者不合适的地方，欢迎批评指正😃。">
<meta property="og:type" content="article">
<meta property="og:title" content="LV03-04-数据结构-线性表-顺序表操作">
<meta property="og:url" content="https://sumumm.github.io/post/e29c3a2f.html">
<meta property="og:site_name" content="苏木">
<meta property="og:description" content="本文主要是数据结构——顺序表的一些基础操作，如增删改查等的相关笔记，若笔记中有错误或者不合适的地方，欢迎批评指正😃。">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929161556161.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929164701834.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929170123005.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929185752607.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930054050126.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/insert.gif">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930073755707.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/delect.gif">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930075917043.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930090451597.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930091533839.png">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/delete_duplicate.gif">
<meta property="og:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20221010084834683.png">
<meta property="article:published_time" content="2022-04-25T01:40:01.000Z">
<meta property="article:modified_time" content="2025-06-13T16:25:56.991Z">
<meta property="article:author" content="苏木">
<meta property="article:tag" content="LV03-数据结构">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929161556161.png">


<link rel="canonical" href="https://sumumm.github.io/post/e29c3a2f.html">



<script class="next-config" data-name="page" type="application/json">{"sidebar":"","isHome":false,"isPost":true,"lang":"zh-CN","comments":true,"permalink":"https://sumumm.github.io/post/e29c3a2f.html","path":"post/e29c3a2f.html","title":"LV03-04-数据结构-线性表-顺序表操作"}</script>

<script class="next-config" data-name="calendar" type="application/json">""</script>
<title>LV03-04-数据结构-线性表-顺序表操作 | 苏木</title>
  








    <script src="/js/browser_tools_disable.js"></script>

  <noscript>
    <link rel="stylesheet" href="/css/noscript.css">
  </noscript>
<!-- hexo injector head_end start --><link rel="stylesheet" href="https://unpkg.com/hexo-next-tags-plus@latest/lib/tag_plus.css" media="defer" onload="this.media='all'"><!-- hexo injector head_end end --></head>

<body itemscope itemtype="http://schema.org/WebPage" class="use-motion">
  <div class="headband"></div>

  <main class="main">
    <div class="column">
      <header class="header" itemscope itemtype="http://schema.org/WPHeader"><div class="site-brand-container">
  <div class="site-nav-toggle">
    <div class="toggle" aria-label="切换导航栏" role="button">
        <span class="toggle-line"></span>
        <span class="toggle-line"></span>
        <span class="toggle-line"></span>
    </div>
  </div>

  <div class="site-meta">

    <a href="/" class="brand" rel="start">
      <i class="logo-line"></i>
      <p class="site-title">苏木</p>
      <i class="logo-line"></i>
    </a>
      <p class="site-subtitle" itemprop="description">我的学习之路</p>
  </div>

  <div class="site-nav-right">
    <div class="toggle popup-trigger" aria-label="搜索" role="button">
        <i class="fa fa-search fa-fw fa-lg"></i>
    </div>
  </div>
</div>



<nav class="site-nav">
  <ul class="main-menu menu"><li class="menu-item menu-item-home"><a href="/" rel="section"><i class="fa fa-home fa-fw"></i>苏木的家</a></li><li class="menu-item menu-item-categories"><a href="/categories/" rel="section"><i class="fa fa-th fa-fw"></i>分类页<span class="badge">42</span></a></li><li class="menu-item menu-item-archives"><a href="/archives/" rel="section"><i class="fa fa-archive fa-fw"></i>归档页<span class="badge">673</span></a></li><li class="menu-item menu-item-flink"><a href="/flink/" rel="section"><i class="fa fa-link fa-fw"></i>友人帐</a></li><li class="menu-item menu-item-about"><a href="/about/" rel="section"><i class="fa fa-user fa-fw"></i>关于我</a></li>
      <li class="menu-item menu-item-search">
        <a role="button" class="popup-trigger"><i class="fa fa-search fa-fw"></i>搜索
        </a>
      </li>
  </ul>
</nav>



  <div class="search-pop-overlay">
    <div class="popup search-popup"><div class="search-header">
  <span class="search-icon">
    <i class="fa fa-search"></i>
  </span>
  <div class="search-input-container">
    <input autocomplete="off" autocapitalize="off" maxlength="80"
           placeholder="搜索..." spellcheck="false"
           type="search" class="search-input">
  </div>
  <span class="popup-btn-close" role="button">
    <i class="fa fa-times-circle"></i>
  </span>
</div>
<div class="search-result-container no-result">
  <div class="search-result-icon">
    <i class="fa fa-spinner fa-pulse fa-5x"></i>
  </div>
</div>

    </div>
  </div>

</header>
        
  
  <aside class="sidebar">

    <div class="sidebar-inner sidebar-nav-active sidebar-toc-active">
      <ul class="sidebar-nav">
        <li class="sidebar-nav-toc">
          文章目录
        </li>
        <li class="sidebar-nav-overview">
          站点概览
        </li>
      </ul>

      <div class="sidebar-panel-container">
        <!--noindex-->
        <div class="post-toc-wrap sidebar-panel">
            <div class="post-toc animated"><ol class="nav"><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%B8%80%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84%E5%88%9B%E5%BB%BA"><span class="nav-text">一、顺序表的创建</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E5%88%9B%E5%BB%BA%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.创建步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%BA%8C%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84%E9%87%8A%E6%94%BE"><span class="nav-text">二、顺序表的释放</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E9%87%8A%E6%94%BE%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.释放步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-1"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%B8%89%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84%E9%95%BF%E5%BA%A6"><span class="nav-text">三、顺序表的长度</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%B1%82%E8%A1%A8%E9%95%BF%E5%BA%A6%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.求表长度步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-2"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%9B%9B%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84%E7%A9%BA%E6%BB%A1"><span class="nav-text">四、顺序表的空满</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E7%A9%BA%E6%BB%A1%E5%88%A4%E5%AE%9A%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.空满判定步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-3"><span class="nav-text">2.函数实现</span></a><ol class="nav-child"><li class="nav-item nav-level-3"><a class="nav-link" href="#2-1%E9%A1%BA%E5%BA%8F%E8%A1%A8%E4%B8%BA%E7%A9%BA%E5%88%A4%E5%AE%9A"><span class="nav-text">2.1顺序表为空判定</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#2-2%E9%A1%BA%E5%BA%8F%E8%A1%A8%E4%B8%BA%E6%BB%A1%E5%88%A4%E5%AE%9A"><span class="nav-text">2.2顺序表为满判定</span></a></li></ol></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%BA%94%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84%E6%B8%85%E7%A9%BA"><span class="nav-text">五、顺序表的清空</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%B8%85%E7%A9%BA%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.清空步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-4"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%85%AD%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E6%8F%92%E5%85%A5"><span class="nav-text">六、顺序表数据插入</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%95%B0%E6%8D%AE%E6%8F%92%E5%85%A5%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.数据插入步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-5"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%B8%83%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E5%88%A0%E9%99%A4"><span class="nav-text">七、顺序表数据删除</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E5%88%A0%E9%99%A4%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.删除步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-6"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%85%AB%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E6%98%BE%E7%A4%BA"><span class="nav-text">八、顺序表数据显示</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%95%B0%E6%8D%AE%E6%98%BE%E7%A4%BA%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.数据显示步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-7"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E4%B9%9D%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E6%9F%A5%E6%89%BE"><span class="nav-text">九、顺序表数据查找</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%9F%A5%E6%89%BE%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.查找步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-8"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8D%81%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E5%8E%BB%E9%87%8D"><span class="nav-text">十、顺序表数据去重</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%95%B0%E6%8D%AE%E5%8E%BB%E9%87%8D%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.数据去重步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-9"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8D%81%E4%B8%80%E3%80%81%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%95%B0%E6%8D%AE%E5%90%88%E5%B9%B6"><span class="nav-text">十一、顺序表数据合并</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-%E6%95%B0%E6%8D%AE%E5%90%88%E5%B9%B6%E6%AD%A5%E9%AA%A4"><span class="nav-text">1.数据合并步骤</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0-10"><span class="nav-text">2.函数实现</span></a></li></ol></li><li class="nav-item nav-level-1"><a class="nav-link" href="#%E5%8D%81%E4%BA%8C%E3%80%81%E5%AE%8C%E6%95%B4%E7%A8%8B%E5%BA%8F"><span class="nav-text">十二、完整程序</span></a><ol class="nav-child"><li class="nav-item nav-level-2"><a class="nav-link" href="#1-seqlist-c"><span class="nav-text">1. seqlist.c</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#2-seqlist-h"><span class="nav-text">2. seqlist.h</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#3-Makefile"><span class="nav-text">3. Makefile</span></a></li><li class="nav-item nav-level-2"><a class="nav-link" href="#4-main-c"><span class="nav-text">4. main.c</span></a></li></ol></li></ol></div>
        </div>
        <!--/noindex-->

        <div class="site-overview-wrap sidebar-panel">
          <div class="site-author animated" itemprop="author" itemscope itemtype="http://schema.org/Person">
    <img class="site-author-image" itemprop="image" alt="苏木"
      src="/images/avatar.jpg">
  <p class="site-author-name" itemprop="name">苏木</p>
  <div class="site-description" itemprop="description">莫道桑榆晚，为霞尚满天</div>
</div>
<div class="site-state-wrap animated">
  <nav class="site-state">
      <div class="site-state-item site-state-posts">
        <a href="/archives/">
          <span class="site-state-item-count">673</span>
          <span class="site-state-item-name">日志</span>
        </a>
      </div>
      <div class="site-state-item site-state-categories">
          <a href="/categories/">
        <span class="site-state-item-count">42</span>
        <span class="site-state-item-name">分类</span></a>
      </div>
      <div class="site-state-item site-state-tags">
        <span class="site-state-item-count">43</span>
        <span class="site-state-item-name">标签</span>
      </div>
  </nav>
</div>
  <div class="links-of-author animated">
      <span class="links-of-author-item">
        <a href="https://github.com/sumumm" title="GitHub → https:&#x2F;&#x2F;github.com&#x2F;sumumm" rel="noopener me" target="_blank"><i class="fab fa-github fa-fw"></i>GitHub</a>
      </span>
  </div>

        </div>
      </div>
    </div>

    
  </aside>


    </div>

    <div class="main-inner post posts-expand">


  


<div class="post-block">
  
  

  <article itemscope itemtype="http://schema.org/Article" class="post-content" lang="zh-CN">
    <link itemprop="mainEntityOfPage" href="https://sumumm.github.io/post/e29c3a2f.html">

    <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
      <meta itemprop="image" content="/images/avatar.jpg">
      <meta itemprop="name" content="苏木">
    </span>

    <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
      <meta itemprop="name" content="苏木">
      <meta itemprop="description" content="莫道桑榆晚，为霞尚满天">
    </span>

    <span hidden itemprop="post" itemscope itemtype="http://schema.org/CreativeWork">
      <meta itemprop="name" content="LV03-04-数据结构-线性表-顺序表操作 | 苏木">
      <meta itemprop="description" content="">
    </span>
      <header class="post-header">
        <h1 class="post-title" itemprop="name headline">
          LV03-04-数据结构-线性表-顺序表操作
        </h1>

        <div class="post-meta-container">
          <div class="post-meta">
    <span class="post-meta-item">
      <span class="post-meta-item-icon">
        <i class="far fa-calendar"></i>
      </span>
      <span class="post-meta-item-text">发表于</span>

      <time title="创建时间：2022-04-25 09:40:01" itemprop="dateCreated datePublished" datetime="2022-04-25T09:40:01+08:00">2022-04-25</time>
    </span>
    <span class="post-meta-item">
      <span class="post-meta-item-icon">
        <i class="far fa-folder"></i>
      </span>
      <span class="post-meta-item-text">分类于</span>
        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
          <a href="/categories/%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/" itemprop="url" rel="index"><span itemprop="name">嵌入式开发</span></a>
        </span>
          ，
        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
          <a href="/categories/%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/" itemprop="url" rel="index"><span itemprop="name">01HQ课程体系</span></a>
        </span>
          ，
        <span itemprop="about" itemscope itemtype="http://schema.org/Thing">
          <a href="/categories/%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/" itemprop="url" rel="index"><span itemprop="name">LV03-数据结构</span></a>
        </span>
    </span>

  
    <span class="post-meta-break"></span>
    <span class="post-meta-item" title="本文字数">
      <span class="post-meta-item-icon">
        <i class="far fa-file-word"></i>
      </span>
      <span class="post-meta-item-text">本文字数：</span>
      <span>7.1k</span>
    </span>
    <span class="post-meta-item" title="阅读时长">
      <span class="post-meta-item-icon">
        <i class="far fa-clock"></i>
      </span>
      <span class="post-meta-item-text">阅读时长 &asymp;</span>
      <span>26 分钟</span>
    </span>
</div>

        </div>
      </header>

    
    
    
    <div class="post-body" itemprop="articleBody"><p>本文主要是数据结构——顺序表的一些基础操作，如增删改查等的相关笔记，若笔记中有错误或者不合适的地方，欢迎批评指正😃。</p>
<span id="more"></span>

<!-- Photo: https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/ -->

<details class="folding-tag" blue><summary> 点击查看使用工具及版本 </summary>
              <div class='content'>
              <table>    <tr>        <td align="center" width=150px>Windows</td>        <td align="left">windows11</td>    </tr>    <tr>        <td align="center">Ubuntu</td>        <td align="left">Ubuntu16.04的64位版本</td>      </tr>    <tr>        <td align="center">VMware® Workstation 16 Pro</td>        <td align="left">16.2.3 build-19376536</td>      </tr>    <tr>        <td align="center">SecureCRT</td>        <td align="left">Version 8.7.2 (x64 build 2214)   -   正式版-2020年5月14日</td>      </tr>    <tr>        <td align="center">开发板</td>        <td align="left">正点原子 i.MX6ULL Linux阿尔法开发板</td>      </tr>    <tr>        <td align="center">uboot</td>        <td align="left">NXP官方提供的uboot，NXP提供的版本为uboot-imx-rel_imx_4.1.15_2.1.0_ga(使用的uboot版本为U-Boot 2016.03)</td>      </tr>    <tr>        <td align="center">linux内核</td>        <td align="left">linux-4.15(NXP官方提供)</td>      </tr>    <tr>        <td align="center">STM32开发板</td>        <td align="left">正点原子战舰V3(STM32F103ZET6)</td>      </tr></table>
              </div>
            </details>

<details class="folding-tag" blue><summary> 点击查看本文参考资料 </summary>
              <div class='content'>
              <table>    <tr><td align="center">参考方向  </td><td align="center">参考原文</td></tr>    <tr><td align="left">---</td><td align="left"><a href="" target="_blank">--- <i class="fa fa-external-link-alt"></i> </a></td></tr></table>
              </div>
            </details>

<details class="folding-tag" blue><summary> 点击查看相关文件下载 </summary>
              <div class='content'>
              <table>    <tr>        <td align="center">---</td>        <td align="left">--- <a href="" target="_blank">  <i class="fa fa-external-link-alt"></i></a></td>      </tr></table>
              </div>
            </details>

<p>这一部分主要是对顺序表各种操作的实现，例如顺序表的创建，插入，显示，删除，释放，去重等操作。</p>
<h1 id="一、顺序表的创建"><a href="#一、顺序表的创建" class="headerlink" title="一、顺序表的创建"></a><font size=3>一、顺序表的创建</font></h1><h2 id="1-创建步骤"><a href="#1-创建步骤" class="headerlink" title="1.创建步骤"></a><font size=3>1.创建步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929161556161.png" alt="image-20220929161556161" style="zoom: 33%;" />

<p><strong>【注意】</strong></p>
<p>（1） L-&gt;last 的值代表了 data[N] 中最后一个<strong>有效数据</strong>的下标，<strong>后边的图会用箭头来指示，但是它并不是指针</strong>，若将 L-&gt;last 加上 1 ，就可以得到数组有效元素的个数。</p>
<p>（2）创建线性表的时候用到了 malloc 和 memset 两个函数，需要加上两个函数对应的头文件。</p>
<h2 id="2-函数实现"><a href="#2-函数实现" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_create</span></span><br><span class="line"><span class="comment"> * @brief      : 创建一个顺序表</span></span><br><span class="line"><span class="comment"> * @param arg  : none</span></span><br><span class="line"><span class="comment"> * @return     : seqlistlink 类型，返回创建的顺序表首地址</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line">_seqlistlink <span class="title function_">seqlist_create</span><span class="params">(<span class="type">void</span>)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="comment">/* 0.相关变量定义 */</span></span><br><span class="line">    _seqlistlink L; <span class="comment">/* 定义一个结构体指针变量 L */</span></span><br><span class="line">    <span class="comment">/* 1. malloc 申请顺序表内存空间 */</span></span><br><span class="line">    L = (_seqlistlink)<span class="built_in">malloc</span>(<span class="keyword">sizeof</span>(_seqlist)); <span class="comment">/* stdlib.h 头文件中的函数 */</span></span><br><span class="line">    <span class="comment">/* 2. 判断是否申请成功 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]sequence list malloc failed!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> L;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.申请的内存空间初始化 */</span></span><br><span class="line">    <span class="built_in">memset</span>(L, <span class="number">0</span>, <span class="keyword">sizeof</span>(_seqlist)); <span class="comment">/* string.h 头文件中的函数，数组元素全部赋值为0 */</span></span><br><span class="line">    L-&gt;last = <span class="number">-1</span>;                  <span class="comment">/* 空表时为 -1 */</span></span><br><span class="line">    <span class="keyword">return</span> L;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="二、顺序表的释放"><a href="#二、顺序表的释放" class="headerlink" title="二、顺序表的释放"></a><font size=3>二、顺序表的释放</font></h1><h2 id="1-释放步骤"><a href="#1-释放步骤" class="headerlink" title="1.释放步骤"></a><font size=3>1.释放步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929164701834.png" alt="image-20220929164701834" style="zoom: 33%;" />

<p><strong>【注意】</strong></p>
<p>（1）释放的时候直接释放顺序表结构体指针变量指向的内存空间即可。</p>
<p>（2）可以判断一下要释放的顺序表是否存在。</p>
<h2 id="2-函数实现-1"><a href="#2-函数实现-1" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_free</span></span><br><span class="line"><span class="comment"> * @brief      : 释放顺序表占用的内存空间</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示要释放的顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，顺序表不存在返回-1,释放完成返回0</span></span><br><span class="line"><span class="comment"> * @Description: </span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_free</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">		<span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">	<span class="built_in">free</span>(L);</span><br><span class="line">	L = <span class="literal">NULL</span>;</span><br><span class="line">	<span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="三、顺序表的长度"><a href="#三、顺序表的长度" class="headerlink" title="三、顺序表的长度"></a><font size=3>三、顺序表的长度</font></h1><h2 id="1-求表长度步骤"><a href="#1-求表长度步骤" class="headerlink" title="1.求表长度步骤"></a><font size=3>1.求表长度步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929170123005.png" alt="image-20220929170123005" style="zoom: 33%;" />

<p>从上图可以看出，其实整个顺序表的长度是顺序表结构体成员 last 来决定的，它决定了顺序表中有效数据元素的个数，只要它是 -1，就代表顺序表中没有数据，即便是顺序表中的数据有一个值，但是我们依然认为这是一个空表。</p>
<p><strong>【注意】</strong>为了使 last 成员可以和数组最后一个元素的下表对应，设置了初始的 last 成员为 -1，所以 last + 1 才是实际有效元素个数。</p>
<h2 id="2-函数实现-2"><a href="#2-函数实现-2" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_length</span></span><br><span class="line"><span class="comment"> * @brief      : 求顺序表长度</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回L-&gt;last+1,顺序表有效元素个数;返回-1,顺序表地址为NULL</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_length</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="keyword">return</span> (L-&gt;last + <span class="number">1</span>);</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="四、顺序表的空满"><a href="#四、顺序表的空满" class="headerlink" title="四、顺序表的空满"></a><font size=3>四、顺序表的空满</font></h1><h2 id="1-空满判定步骤"><a href="#1-空满判定步骤" class="headerlink" title="1.空满判定步骤"></a><font size=3>1.空满判定步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220929185752607.png" alt="image-20220929185752607" style="zoom: 33%;" />

<p>【注意】顺序表 L 的空满由 L-&gt;last 成员决定，而非是顺序表数组成员中存储了多少个数据，</p>
<table>
<thead>
<tr>
<th>判断条件</th>
<th>说明</th>
</tr>
</thead>
<tbody><tr>
<td>L-&gt;last &#x3D; -1</td>
<td>认为顺序表为空</td>
</tr>
<tr>
<td>L-&gt;last &#x3D; N - 1</td>
<td>认为顺序表为满</td>
</tr>
</tbody></table>
<h2 id="2-函数实现-3"><a href="#2-函数实现-3" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><h3 id="2-1顺序表为空判定"><a href="#2-1顺序表为空判定" class="headerlink" title="2.1顺序表为空判定"></a><font size=3>2.1顺序表为空判定</font></h3><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_empty</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表是否为空</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回1,表示顺序表为空;返回0,表示顺序表非空</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_empty</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h3 id="2-2顺序表为满判定"><a href="#2-2顺序表为满判定" class="headerlink" title="2.2顺序表为满判定"></a><font size=3>2.2顺序表为满判定</font></h3><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_full</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表是否为满</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回1,表示顺序表为满;返回0,表示顺序表未满</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_full</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == N - <span class="number">1</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="五、顺序表的清空"><a href="#五、顺序表的清空" class="headerlink" title="五、顺序表的清空"></a><font size=3>五、顺序表的清空</font></h1><h2 id="1-清空步骤"><a href="#1-清空步骤" class="headerlink" title="1.清空步骤"></a><font size=3>1.清空步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930054050126.png" alt="image-20220930054050126" style="zoom:50%;" />

<p><strong>【注意】</strong>对于顺序表来说，里边是否存放了元素，存放了多少个元素是由顺序表中代表顺序表有效元素个数的 last 成员决定的。</p>
<table>
<thead>
<tr>
<th>判断条件</th>
<th>说明</th>
</tr>
</thead>
<tbody><tr>
<td>L-&gt;last &#x3D; -1</td>
<td>认为顺序表为空</td>
</tr>
<tr>
<td>L-&gt;last &#x3D; N - 1</td>
<td>认为顺序表为满</td>
</tr>
</tbody></table>
<p>所以，对于顺序表的清空，我们只需要<strong>将 L-&gt;last 赋值为 -1 ，就可以认为此顺序表已经清空</strong>。</p>
<h2 id="2-函数实现-4"><a href="#2-函数实现-4" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_clear</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表清空</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回-1,表示顺序表不存在，返回0,表示清空完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_clear</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">memset</span>(L, <span class="number">0</span>, <span class="keyword">sizeof</span>(seqlist));</span><br><span class="line">    L-&gt;last = <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="六、顺序表数据插入"><a href="#六、顺序表数据插入" class="headerlink" title="六、顺序表数据插入"></a><font size=3>六、顺序表数据插入</font></h1><h2 id="1-数据插入步骤"><a href="#1-数据插入步骤" class="headerlink" title="1.数据插入步骤"></a><font size=3>1.数据插入步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/insert.gif" alt="insert" style="zoom:50%;" />

<p>如上图所示，我们分为头部插入，尾部插入和中间插入，分析过后，其实可以归结为一类，就是在指定位置插入数据，头部和尾部的时候是两种特殊性情况，但是处理方式就可以与中间插入的这种普遍情况一样。一般步骤如下：</p>
<img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930073755707.png" alt="image-20220930073755707" style="zoom:50%;" />



<h2 id="2-函数实现-5"><a href="#2-函数实现-5" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_insert</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表数据按位置插入</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param value：data_t 类型，表示要插入的数据</span></span><br><span class="line"><span class="comment"> * @param pos  ：int类型，表示要插入的位置, 有效区间为[0, L-&gt;last+1]</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回0,表示插入成功;返回-1,表示插入失败</span></span><br><span class="line"><span class="comment"> * @Description: </span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_insert</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value, <span class="type">int</span> pos)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否已满 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == N - <span class="number">1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is full\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 2. 判断插入位置是否合法 [0, L-&gt;last+1]*/</span></span><br><span class="line">    <span class="keyword">if</span> (pos &lt; <span class="number">0</span> || pos &gt; L-&gt;last + <span class="number">1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]pos is invalid!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.移动插入位置后边的数据 */</span></span><br><span class="line">    <span class="keyword">for</span> (i = L-&gt;last; i &gt;= pos; i--) <span class="comment">/* L-&gt;last就代表了最后一个元素的下标 */</span></span><br><span class="line">    &#123;</span><br><span class="line">        L-&gt;data[i + <span class="number">1</span>] = L-&gt;data[i]; <span class="comment">/* pos下标后边的数据全部后移一个位置 */</span></span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 4.更新数据并更新顺序表长度 */</span></span><br><span class="line">    L-&gt;data[pos] = value;</span><br><span class="line">    L-&gt;last++;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="七、顺序表数据删除"><a href="#七、顺序表数据删除" class="headerlink" title="七、顺序表数据删除"></a><font size=3>七、顺序表数据删除</font></h1><h2 id="1-删除步骤"><a href="#1-删除步骤" class="headerlink" title="1.删除步骤"></a><font size=3>1.删除步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/delect.gif" alt="delect" style="zoom:50%;" />

<p>有上图可知，我们删除顺序表指定位置数据的时候只需要将该位置后边所有元素前移一个位置即可，一般步骤如下：</p>
<img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930075917043.png" alt="image-20220930075917043" style="zoom:50%;" />

<h2 id="2-函数实现-6"><a href="#2-函数实现-6" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_delete</span></span><br><span class="line"><span class="comment"> * @brief      : 删除顺序表指定位置元素</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param pos  ：int类型，表示要删除的位置, 有效区间为[0, L-&gt;last]</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回0,表示删除成功;返回-1,表示删除失败</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete</span><span class="params">(_seqlistlink L, <span class="type">int</span> pos)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1.判断顺序表是否为空 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is empty!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 2.判断 pos 是否合法，合法区间为 [0, L-&gt;last] */</span></span><br><span class="line">    <span class="keyword">if</span> (pos &lt; <span class="number">0</span> || pos &gt; L-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]delete pos is invalid!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 3.移动删除位置后的元素以填补空缺，涉及元素区间为 [pos+1, L-&gt;last] */</span></span><br><span class="line">    <span class="keyword">for</span> (i = pos + <span class="number">1</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        L-&gt;data[i - <span class="number">1</span>] = L-&gt;data[i];</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 4.更新顺序表元素个数 */</span></span><br><span class="line">    L-&gt;last--;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="八、顺序表数据显示"><a href="#八、顺序表数据显示" class="headerlink" title="八、顺序表数据显示"></a><font size=3>八、顺序表数据显示</font></h1><h2 id="1-数据显示步骤"><a href="#1-数据显示步骤" class="headerlink" title="1.数据显示步骤"></a><font size=3>1.数据显示步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930090451597.png" alt="image-20220930090451597" style="zoom:50%;" />

<p>对于数据的显示，我们就像对数组遍历一样，遍历整个顺序表，然后打印出数据即可。</p>
<h2 id="2-函数实现-7"><a href="#2-函数实现-7" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_show</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表元素显示</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示顺序表不存在;返回0,表示显示完毕</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_show</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否存在 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="comment">/* 2. 判断顺序表是否为空 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is empty!\n&quot;</span>);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.开始遍历顺序表中所有元素，并打印 */</span></span><br><span class="line">    <span class="built_in">printf</span>(<span class="string">&quot;sequence list:&quot;</span>);</span><br><span class="line">    <span class="keyword">for</span> (i = <span class="number">0</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;%d &quot;</span>, L-&gt;data[i]);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">puts</span>(<span class="string">&quot;&quot;</span>); <span class="comment">/* 自带换行符 */</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="九、顺序表数据查找"><a href="#九、顺序表数据查找" class="headerlink" title="九、顺序表数据查找"></a><font size=3>九、顺序表数据查找</font></h1><h2 id="1-查找步骤"><a href="#1-查找步骤" class="headerlink" title="1.查找步骤"></a><font size=3>1.查找步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20220930091533839.png" alt="image-20220930091533839" style="zoom:50%;" />

<p>对于顺序表中数据元素的查找，我们直接遍历整个顺序表，查看数据是否存在于顺序表中即可，若是有重复的数据，我们只返回首个出现的下标。</p>
<h2 id="2-函数实现-8"><a href="#2-函数实现-8" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_locate</span></span><br><span class="line"><span class="comment"> * @brief      : 在顺序表中查找指定数据位置（若有重复，则显示首次出现的位置）</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param value：data_t类型，表示要查找的元素</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示要查找的元素不存在或者顺序表不存在;返回非负数,表示要查找的数据的下标</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_locate</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否存在 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="keyword">for</span> (i = <span class="number">0</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">if</span> (L-&gt;data[i] == value)</span><br><span class="line">            <span class="keyword">return</span> i;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="十、顺序表数据去重"><a href="#十、顺序表数据去重" class="headerlink" title="十、顺序表数据去重"></a><font size=3>十、顺序表数据去重</font></h1><h2 id="1-数据去重步骤"><a href="#1-数据去重步骤" class="headerlink" title="1.数据去重步骤"></a><font size=3>1.数据去重步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/delete_duplicate.gif" alt="delete_duplicate" style="zoom:50%;" />

<p>【思路】</p>
<p>对于去重，我们这里使用的方式是从第二个数据开始（下标为 1 ），逐个与前边的数据相比较，若发现与前边的某个数据重复，则将该数据删除，也就是将当前数据后边的数据逐个左移，覆盖当前数据，然后重复比较，直至到顺序表结尾。</p>
<p>【注意】若有重复，原本  i+1  位置的元素补到第  i  个位置，此时  i  位置上的元素需要再进行比较，所以  i  不需要往后移；若没有重复，内层循环退出后，j 的值小于 0 ，只有在此种情况下 i 才需要往后移动。</p>
<h2 id="2-函数实现-9"><a href="#2-函数实现-9" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_delete_duplicate</span></span><br><span class="line"><span class="comment"> * @brief      : 在顺序表中删除重复元素，只保留首次出现的数据</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示顺序表不存在;返回0,表示去重完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete_duplicate</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="type">int</span> j = <span class="number">0</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">0</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    i = <span class="number">1</span>;</span><br><span class="line">    <span class="comment">/* i 从 1 开始，往后移动，第 i 个数依次与它前边的比较，相同的就直接把第 i 个位置元素删除 */</span></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= L-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        j = i - <span class="number">1</span>;</span><br><span class="line">        <span class="keyword">while</span> (j &gt;= <span class="number">0</span>) <span class="comment">/* 逐个向前比较 */</span></span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span> (L-&gt;data[i] == L-&gt;data[j]) <span class="comment">/* 若有相同的，就删除这个位置的元素，并退出比较循环 */</span></span><br><span class="line">            &#123;</span><br><span class="line">                seqlist_delete(L, i); <span class="comment">/* 原本 i+1 位置的元素补到第 i 个位置 */</span></span><br><span class="line">                <span class="keyword">break</span>;</span><br><span class="line">            &#125;</span><br><span class="line">            <span class="keyword">else</span> <span class="comment">/* 若没有相同的，继续向前比较 */</span></span><br><span class="line">                j--;</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="comment">/* 若有重复，原本 i+1 位置的元素补到第 i 个位置，此时 i 位置上的元素需要再进行比较，所以 i 不需要往后移</span></span><br><span class="line"><span class="comment">           若没有重复，上边循环退出后，j 的值小于 0，只有在此种情况下才需要往后移动。 */</span></span><br><span class="line">        <span class="keyword">if</span> (j &lt; <span class="number">0</span>)</span><br><span class="line">            i++;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="十一、顺序表数据合并"><a href="#十一、顺序表数据合并" class="headerlink" title="十一、顺序表数据合并"></a><font size=3>十一、顺序表数据合并</font></h1><h2 id="1-数据合并步骤"><a href="#1-数据合并步骤" class="headerlink" title="1.数据合并步骤"></a><font size=3>1.数据合并步骤</font></h2><img data-src="https://fanhua-picture.oss-cn-hangzhou.aliyuncs.com/01%E5%B5%8C%E5%85%A5%E5%BC%8F%E5%BC%80%E5%8F%91/01HQ%E8%AF%BE%E7%A8%8B%E4%BD%93%E7%B3%BB/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/LV03-04-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84-%E7%BA%BF%E6%80%A7%E8%A1%A8-%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%93%8D%E4%BD%9C/img/image-20221010084834683.png" alt="image-20221010084834683" style="zoom:50%;" />

<ul>
<li>（1）在 L1 中查找 L2 中的每个数据；</li>
<li>（2）若 L1 中已有，则继续下一个的查找，若 L1 中没有，则将此数据插入到 L1 后边。</li>
</ul>
<h2 id="2-函数实现-10"><a href="#2-函数实现-10" class="headerlink" title="2.函数实现"></a><font size=3>2.函数实现</font></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_merge</span></span><br><span class="line"><span class="comment"> * @brief      : 求两个顺序表并集，保持第二个顺序表不变</span></span><br><span class="line"><span class="comment"> * @param L1   ：_seqlistlink类型，表示顺序表1地址</span></span><br><span class="line"><span class="comment"> * @param L2   ：_seqlistlink类型，表示顺序表2地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示合并失败;返回0,表示合并完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_merge</span><span class="params">(_seqlistlink L1, _seqlistlink L2)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="type">int</span> ret = <span class="number">0</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= L2-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        ret = seqlist_locate(L1, L2-&gt;data[i]);</span><br><span class="line">        <span class="comment">/* L1中无该元素，才插入该元素 */</span></span><br><span class="line">        <span class="keyword">if</span> (ret == <span class="number">-1</span>)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span> (seqlist_insert(L1, L2-&gt;data[i], L1-&gt;last + <span class="number">1</span>) == <span class="number">-1</span>)</span><br><span class="line">                <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        i++;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>

<h1 id="十二、完整程序"><a href="#十二、完整程序" class="headerlink" title="十二、完整程序"></a><font size=3>十二、完整程序</font></h1><h2 id="1-seqlist-c"><a href="#1-seqlist-c" class="headerlink" title="1. seqlist.c"></a><font size=3>1. seqlist.c</font></h2><details class="folding-tag" blue><summary> 点击查看详情 </summary>
              <div class='content'>
              <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br><span class="line">171</span><br><span class="line">172</span><br><span class="line">173</span><br><span class="line">174</span><br><span class="line">175</span><br><span class="line">176</span><br><span class="line">177</span><br><span class="line">178</span><br><span class="line">179</span><br><span class="line">180</span><br><span class="line">181</span><br><span class="line">182</span><br><span class="line">183</span><br><span class="line">184</span><br><span class="line">185</span><br><span class="line">186</span><br><span class="line">187</span><br><span class="line">188</span><br><span class="line">189</span><br><span class="line">190</span><br><span class="line">191</span><br><span class="line">192</span><br><span class="line">193</span><br><span class="line">194</span><br><span class="line">195</span><br><span class="line">196</span><br><span class="line">197</span><br><span class="line">198</span><br><span class="line">199</span><br><span class="line">200</span><br><span class="line">201</span><br><span class="line">202</span><br><span class="line">203</span><br><span class="line">204</span><br><span class="line">205</span><br><span class="line">206</span><br><span class="line">207</span><br><span class="line">208</span><br><span class="line">209</span><br><span class="line">210</span><br><span class="line">211</span><br><span class="line">212</span><br><span class="line">213</span><br><span class="line">214</span><br><span class="line">215</span><br><span class="line">216</span><br><span class="line">217</span><br><span class="line">218</span><br><span class="line">219</span><br><span class="line">220</span><br><span class="line">221</span><br><span class="line">222</span><br><span class="line">223</span><br><span class="line">224</span><br><span class="line">225</span><br><span class="line">226</span><br><span class="line">227</span><br><span class="line">228</span><br><span class="line">229</span><br><span class="line">230</span><br><span class="line">231</span><br><span class="line">232</span><br><span class="line">233</span><br><span class="line">234</span><br><span class="line">235</span><br><span class="line">236</span><br><span class="line">237</span><br><span class="line">238</span><br><span class="line">239</span><br><span class="line">240</span><br><span class="line">241</span><br><span class="line">242</span><br><span class="line">243</span><br><span class="line">244</span><br><span class="line">245</span><br><span class="line">246</span><br><span class="line">247</span><br><span class="line">248</span><br><span class="line">249</span><br><span class="line">250</span><br><span class="line">251</span><br><span class="line">252</span><br><span class="line">253</span><br><span class="line">254</span><br><span class="line">255</span><br><span class="line">256</span><br><span class="line">257</span><br><span class="line">258</span><br><span class="line">259</span><br><span class="line">260</span><br><span class="line">261</span><br><span class="line">262</span><br><span class="line">263</span><br><span class="line">264</span><br><span class="line">265</span><br><span class="line">266</span><br><span class="line">267</span><br><span class="line">268</span><br><span class="line">269</span><br><span class="line">270</span><br><span class="line">271</span><br><span class="line">272</span><br><span class="line">273</span><br><span class="line">274</span><br><span class="line">275</span><br><span class="line">276</span><br><span class="line">277</span><br><span class="line">278</span><br><span class="line">279</span><br><span class="line">280</span><br><span class="line">281</span><br><span class="line">282</span><br><span class="line">283</span><br><span class="line">284</span><br><span class="line">285</span><br><span class="line">286</span><br><span class="line">287</span><br><span class="line">288</span><br><span class="line">289</span><br><span class="line">290</span><br><span class="line">291</span><br><span class="line">292</span><br><span class="line">293</span><br><span class="line">294</span><br><span class="line">295</span><br><span class="line">296</span><br><span class="line">297</span><br><span class="line">298</span><br><span class="line">299</span><br><span class="line">300</span><br><span class="line">301</span><br><span class="line">302</span><br><span class="line">303</span><br><span class="line">304</span><br><span class="line">305</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/** =====================================================</span></span><br><span class="line"><span class="comment"> * Copyright © hk. 2022-2025. All rights reserved.</span></span><br><span class="line"><span class="comment"> * File name  : seqlist.c</span></span><br><span class="line"><span class="comment"> * Author     : qidaink</span></span><br><span class="line"><span class="comment"> * Date       : 2022-09-29</span></span><br><span class="line"><span class="comment"> * Version    :</span></span><br><span class="line"><span class="comment"> * Description:</span></span><br><span class="line"><span class="comment"> * Others     :</span></span><br><span class="line"><span class="comment"> * Log        :</span></span><br><span class="line"><span class="comment"> * ======================================================</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&quot;seqlist.h&quot;</span></span></span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_create</span></span><br><span class="line"><span class="comment"> * @brief      : 创建一个顺序表</span></span><br><span class="line"><span class="comment"> * @param arg  : none</span></span><br><span class="line"><span class="comment"> * @return     : seqlistlink 类型，返回创建的顺序表首地址</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line">_seqlistlink <span class="title function_">seqlist_create</span><span class="params">(<span class="type">void</span>)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="comment">/* 0.相关变量定义 */</span></span><br><span class="line">    _seqlistlink L; <span class="comment">/* 定义一个结构体指针变量 L */</span></span><br><span class="line">    <span class="comment">/* 1. malloc 申请顺序表内存空间 */</span></span><br><span class="line">    L = (_seqlistlink)<span class="built_in">malloc</span>(<span class="keyword">sizeof</span>(_seqlist)); <span class="comment">/* stdlib.h 头文件中的函数 */</span></span><br><span class="line">    <span class="comment">/* 2. 判断是否申请成功 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]sequence list malloc failed!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> L;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.申请的内存空间初始化 */</span></span><br><span class="line">    <span class="built_in">memset</span>(L, <span class="number">0</span>, <span class="keyword">sizeof</span>(_seqlist)); <span class="comment">/* string.h 头文件中的函数，数组元素全部赋值为0 */</span></span><br><span class="line">    L-&gt;last = <span class="number">-1</span>;                   <span class="comment">/* 空表时为 -1 */</span></span><br><span class="line">    <span class="keyword">return</span> L;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_free</span></span><br><span class="line"><span class="comment"> * @brief      : 释放顺序表占用的内存空间</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示要释放的顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，顺序表不存在返回-1,释放完成返回0</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_free</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="built_in">free</span>(L);</span><br><span class="line">    L = <span class="literal">NULL</span>;</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_length</span></span><br><span class="line"><span class="comment"> * @brief      : 求顺序表长度</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回L-&gt;last+1,顺序表有效元素个数;返回-1,顺序表地址为NULL</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_length</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="keyword">return</span> (L-&gt;last + <span class="number">1</span>);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_empty</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表是否为空</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回1,表示顺序表为空;返回0,表示顺序表非空</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_empty</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_full</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表是否为满</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回1,表示顺序表为满;返回0,表示顺序表未满</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_full</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == N - <span class="number">1</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">1</span>;</span><br><span class="line">    <span class="keyword">else</span></span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_clear</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表清空</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int 类型，返回-1,表示顺序表不存在，返回0,表示清空完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_clear</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">memset</span>(L, <span class="number">0</span>, <span class="keyword">sizeof</span>(_seqlist));</span><br><span class="line">    L-&gt;last = <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_insert</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表数据按位置插入</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param value：data_t 类型，表示要插入的数据</span></span><br><span class="line"><span class="comment"> * @param pos  ：int类型，表示要插入的位置, 有效区间为[0, L-&gt;last+1]</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回0,表示插入成功;返回-1,表示插入失败</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_insert</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value, <span class="type">int</span> pos)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否已满 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == N - <span class="number">1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is full\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 2. 判断插入位置是否合法 [0, L-&gt;last+1]*/</span></span><br><span class="line">    <span class="keyword">if</span> (pos &lt; <span class="number">0</span> || pos &gt; L-&gt;last + <span class="number">1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]pos is invalid!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.移动插入位置后边的数据 */</span></span><br><span class="line">    <span class="keyword">for</span> (i = L-&gt;last; i &gt;= pos; i--) <span class="comment">/* L-&gt;last就代表了最后一个元素的下标 */</span></span><br><span class="line">    &#123;</span><br><span class="line">        L-&gt;data[i + <span class="number">1</span>] = L-&gt;data[i]; <span class="comment">/* pos下标后边的数据全部后移一个位置 */</span></span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 4.更新数据并更新顺序表长度 */</span></span><br><span class="line">    L-&gt;data[pos] = value;</span><br><span class="line">    L-&gt;last++;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_delete</span></span><br><span class="line"><span class="comment"> * @brief      : 删除顺序表指定位置元素</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param pos  ：int类型，表示要删除的位置, 有效区间为[0, L-&gt;last]</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回0,表示删除成功;返回-1,表示删除失败</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete</span><span class="params">(_seqlistlink L, <span class="type">int</span> pos)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1.判断顺序表是否为空 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is empty!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 2.判断 pos 是否合法，合法区间为 [0, L-&gt;last] */</span></span><br><span class="line">    <span class="keyword">if</span> (pos &lt; <span class="number">0</span> || pos &gt; L-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[ERROR]delete pos is invalid!\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 3.移动删除位置后的元素以填补空缺，涉及元素区间为 [pos+1, L-&gt;last] */</span></span><br><span class="line">    <span class="keyword">for</span> (i = pos + <span class="number">1</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        L-&gt;data[i - <span class="number">1</span>] = L-&gt;data[i];</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">/* 4.更新顺序表元素个数 */</span></span><br><span class="line">    L-&gt;last--;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_show</span></span><br><span class="line"><span class="comment"> * @brief      : 顺序表元素显示</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示顺序表不存在;返回0,表示显示完毕</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_show</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否存在 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="comment">/* 2. 判断顺序表是否为空 */</span></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">-1</span>)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;[WARN ]sequence list is empty!\n&quot;</span>);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="comment">/* 3.开始遍历顺序表中所有元素，并打印 */</span></span><br><span class="line">    <span class="built_in">printf</span>(<span class="string">&quot;sequence list:&quot;</span>);</span><br><span class="line">    <span class="keyword">for</span> (i = <span class="number">0</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="built_in">printf</span>(<span class="string">&quot;%d &quot;</span>, L-&gt;data[i]);</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="built_in">puts</span>(<span class="string">&quot;&quot;</span>); <span class="comment">/* 自带换行符 */</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_locate</span></span><br><span class="line"><span class="comment"> * @brief      : 在顺序表中查找指定数据位置（若有重复，则显示首次出现的位置）</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @param value：data_t类型，表示要查找的元素</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示要查找的元素不存在或者顺序表不存在;返回非负数,表示要查找的数据的下标</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_locate</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="comment">/* 1. 判断顺序表是否存在 */</span></span><br><span class="line">    <span class="keyword">if</span> (L == <span class="literal">NULL</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">    <span class="keyword">for</span> (i = <span class="number">0</span>; i &lt;= L-&gt;last; i++)</span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">if</span> (L-&gt;data[i] == value)</span><br><span class="line">            <span class="keyword">return</span> i;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_delete_duplicate</span></span><br><span class="line"><span class="comment"> * @brief      : 在顺序表中删除重复元素，只保留首次出现的数据</span></span><br><span class="line"><span class="comment"> * @param L    : _seqlistlink类型，表示顺序表的首地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示顺序表不存在;返回0,表示去重完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete_duplicate</span><span class="params">(_seqlistlink L)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="type">int</span> j = <span class="number">0</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (L-&gt;last == <span class="number">0</span>)</span><br><span class="line">        <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line"></span><br><span class="line">    i = <span class="number">1</span>;</span><br><span class="line">    <span class="comment">/* i 从 1 开始，往后移动，第 i 个数依次与它前边的比较，相同的就直接把第 i 个位置元素删除 */</span></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= L-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        j = i - <span class="number">1</span>;</span><br><span class="line">        <span class="keyword">while</span> (j &gt;= <span class="number">0</span>) <span class="comment">/* 逐个向前比较 */</span></span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span> (L-&gt;data[i] == L-&gt;data[j]) <span class="comment">/* 若有相同的，就删除这个位置的元素，并退出比较循环 */</span></span><br><span class="line">            &#123;</span><br><span class="line">                seqlist_delete(L, i); <span class="comment">/* 原本 i+1 位置的元素补到第 i 个位置 */</span></span><br><span class="line">                <span class="keyword">break</span>;</span><br><span class="line">            &#125;</span><br><span class="line">            <span class="keyword">else</span> <span class="comment">/* 若没有相同的，继续向前比较 */</span></span><br><span class="line">                j--;</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="comment">/* 若有重复，原本 i+1 位置的元素补到第 i 个位置，此时 i 位置上的元素需要再进行比较，所以 i 不需要往后移</span></span><br><span class="line"><span class="comment">           若没有重复，上边循环退出后，j 的值小于 0，只有在此种情况下才需要往后移动。 */</span></span><br><span class="line">        <span class="keyword">if</span> (j &lt; <span class="number">0</span>)</span><br><span class="line">            i++;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">/**</span></span><br><span class="line"><span class="comment"> * @Function   : seqlist_merge</span></span><br><span class="line"><span class="comment"> * @brief      : 求两个顺序表并集，保持第二个顺序表不变</span></span><br><span class="line"><span class="comment"> * @param L1   ：_seqlistlink类型，表示顺序表1地址</span></span><br><span class="line"><span class="comment"> * @param L2   ：_seqlistlink类型，表示顺序表2地址</span></span><br><span class="line"><span class="comment"> * @return     : int类型，返回-1,表示合并失败;返回0,表示合并完成</span></span><br><span class="line"><span class="comment"> * @Description:</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_merge</span><span class="params">(_seqlistlink L1, _seqlistlink L2)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> i = <span class="number">0</span>;</span><br><span class="line">    <span class="type">int</span> ret = <span class="number">0</span>;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (i &lt;= L2-&gt;last)</span><br><span class="line">    &#123;</span><br><span class="line">        ret = seqlist_locate(L1, L2-&gt;data[i]);</span><br><span class="line">        <span class="comment">/* L1中无该元素，才插入该元素 */</span></span><br><span class="line">        <span class="keyword">if</span> (ret == <span class="number">-1</span>)</span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">if</span> (seqlist_insert(L1, L2-&gt;data[i], L1-&gt;last + <span class="number">1</span>) == <span class="number">-1</span>)</span><br><span class="line">                <span class="keyword">return</span> <span class="number">-1</span>;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        i++;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
              </div>
            </details>

<h2 id="2-seqlist-h"><a href="#2-seqlist-h" class="headerlink" title="2. seqlist.h"></a><font size=3>2. seqlist.h</font></h2><details class="folding-tag" blue><summary> 点击查看详情 </summary>
              <div class='content'>
              <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/** =====================================================</span></span><br><span class="line"><span class="comment"> * Copyright © hk. 2022-2025. All rights reserved.</span></span><br><span class="line"><span class="comment"> * File name  : seqlist.h</span></span><br><span class="line"><span class="comment"> * Author     : qidaink</span></span><br><span class="line"><span class="comment"> * Date       : 2022-09-29</span></span><br><span class="line"><span class="comment"> * Version    :</span></span><br><span class="line"><span class="comment"> * Description:</span></span><br><span class="line"><span class="comment"> * Others     :</span></span><br><span class="line"><span class="comment"> * Log        :</span></span><br><span class="line"><span class="comment"> * ======================================================</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="meta">#<span class="keyword">ifndef</span> __SEQLIST_H__</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> __SEQLIST_H__</span></span><br><span class="line"></span><br><span class="line"><span class="comment">/* 头文件 */</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;stdio.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;stdlib.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;string.h&gt;</span></span></span><br><span class="line"></span><br><span class="line"><span class="keyword">typedef</span> <span class="type">int</span> <span class="type">data_t</span>;</span><br><span class="line"></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> N 128</span></span><br><span class="line"></span><br><span class="line"><span class="keyword">typedef</span> <span class="class"><span class="keyword">struct</span> __<span class="title">seqlist</span></span></span><br><span class="line"><span class="class">&#123;</span></span><br><span class="line">    <span class="type">data_t</span> data[N];</span><br><span class="line">    <span class="type">int</span> last;</span><br><span class="line">&#125; _seqlist, *_seqlistlink;</span><br><span class="line"></span><br><span class="line"><span class="comment">/* 函数声明 */</span></span><br><span class="line"></span><br><span class="line">_seqlistlink <span class="title function_">seqlist_create</span><span class="params">(<span class="type">void</span>)</span>;                         <span class="comment">/* 创建一个顺序表 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_free</span><span class="params">(_seqlistlink L)</span>;                          <span class="comment">/* 释放顺序表占用的内存空间 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_length</span><span class="params">(_seqlistlink L)</span>;                        <span class="comment">/* 求顺序表长度 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_empty</span><span class="params">(_seqlistlink L)</span>;                         <span class="comment">/* 顺序表是否为空 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_full</span><span class="params">(_seqlistlink L)</span>;                          <span class="comment">/* 顺序表是否为满 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_clear</span><span class="params">(_seqlistlink L)</span>;                         <span class="comment">/* 顺序表清空 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_insert</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value, <span class="type">int</span> pos)</span>; <span class="comment">/* 顺序表数据按位置插入 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete</span><span class="params">(_seqlistlink L, <span class="type">int</span> pos)</span>;               <span class="comment">/* 删除顺序表指定位置元素 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_show</span><span class="params">(_seqlistlink L)</span>;                          <span class="comment">/* 顺序表元素显示 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_locate</span><span class="params">(_seqlistlink L, <span class="type">data_t</span> value)</span>;          <span class="comment">/* 在顺序表中查找指定数据位置（若有重复，则显示首次出现的位置） */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_delete_duplicate</span><span class="params">(_seqlistlink L)</span>;              <span class="comment">/* 在顺序表中删除重复元素，只保留首次出现的数据 */</span></span><br><span class="line"><span class="type">int</span> <span class="title function_">seqlist_merge</span><span class="params">(_seqlistlink L1, _seqlistlink L2)</span>;       <span class="comment">/* 求两个顺序表并集，保持第二个顺序表不变 */</span></span><br><span class="line"></span><br><span class="line"><span class="meta">#<span class="keyword">endif</span></span></span><br><span class="line"></span><br></pre></td></tr></table></figure>
              </div>
            </details>

<h2 id="3-Makefile"><a href="#3-Makefile" class="headerlink" title="3. Makefile"></a><font size=3>3. Makefile</font></h2><details class="folding-tag" blue><summary> 点击查看详情 </summary>
              <div class='content'>
              <figure class="highlight makefile"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">##============================================================================#</span></span><br><span class="line"><span class="comment"># Copyright © hk. 2022-2025. All rights reserved.</span></span><br><span class="line"><span class="comment"># File name  : Makefile</span></span><br><span class="line"><span class="comment"># Author     : qidaink</span></span><br><span class="line"><span class="comment"># Date       : 2022-09-29</span></span><br><span class="line"><span class="comment"># Version    : </span></span><br><span class="line"><span class="comment"># Description: </span></span><br><span class="line"><span class="comment"># Others     : </span></span><br><span class="line"><span class="comment"># Log        : </span></span><br><span class="line"><span class="comment">##============================================================================#</span></span><br><span class="line"><span class="comment">##</span></span><br><span class="line"></span><br><span class="line">TARGET          := main</span><br><span class="line"><span class="comment">#============================================================================#</span></span><br><span class="line"><span class="comment">## 工具设置</span></span><br><span class="line"><span class="comment"># 设置交叉编译器名称</span></span><br><span class="line">CROSS_COMPILE   :=</span><br><span class="line"><span class="comment"># 设置交叉编译器</span></span><br><span class="line">CC              := <span class="variable">$(CROSS_COMPILE)</span>gcc</span><br><span class="line"><span class="comment"># 编译选项</span></span><br><span class="line">CFLAGS          += -g -Wall</span><br><span class="line"><span class="comment">#============================================================================#</span></span><br><span class="line"><span class="comment">## 目录路径设置</span></span><br><span class="line"><span class="comment"># 头文件路径设置(.h)</span></span><br><span class="line">INCDIRS 		:= .</span><br><span class="line"></span><br><span class="line"><span class="comment"># 源文件路径设置(.S .C)</span></span><br><span class="line">SRCDIRS			:= .</span><br><span class="line"></span><br><span class="line"><span class="comment"># 生成的中间 .o 文件的位置</span></span><br><span class="line">OBJDIRS         := .</span><br><span class="line"><span class="comment">#============================================================================#</span></span><br><span class="line"><span class="comment"># 生成编译器的 -I dir_path 参数 </span></span><br><span class="line">INCLUDE			:= <span class="variable">$(<span class="built_in">patsubst</span> %, -I %, <span class="variable">$(INCDIRS)</span>)</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 获取所有的 .C 文件名称(包含路径)</span></span><br><span class="line">CFILES			:= <span class="variable">$(<span class="built_in">foreach</span> <span class="built_in">dir</span>, <span class="variable">$(SRCDIRS)</span>, $(<span class="built_in">wildcard</span> <span class="variable">$(dir)</span>/*.c)</span>)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 获取所有的 .C 文件名称(不包含路径)</span></span><br><span class="line">CFILENDIR		:= <span class="variable">$(<span class="built_in">notdir</span>  <span class="variable">$(CFILES)</span>)</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 指定所有的 .C 生成的 .o 文件名(包含将要存放的路径)</span></span><br><span class="line">COBJS			:= <span class="variable">$(<span class="built_in">patsubst</span> %, <span class="variable">$(OBJDIRS)</span>/%, $(CFILENDIR:.c=.o)</span>)</span><br><span class="line"></span><br><span class="line"><span class="comment"># 将所有要生成的 .o 文件合并到一个变量中(都包含路径)</span></span><br><span class="line">OBJS			:= <span class="variable">$(COBJS)</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 设置源文件路径</span></span><br><span class="line">VPATH			:= <span class="variable">$(SRCDIRS)</span></span><br><span class="line"></span><br><span class="line"><span class="comment">#============================================================================#			</span></span><br><span class="line"><span class="comment"># 生成目标文件	   </span></span><br><span class="line"><span class="variable">$(TARGET)</span>: <span class="variable">$(OBJS)</span></span><br><span class="line">	<span class="variable">$(CC)</span> <span class="variable">$(CFLAGS)</span> <span class="variable">$^</span> -o <span class="variable">$(TARGET)</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 隐含规则推导相关中间文件</span></span><br><span class="line"><span class="variable">$(COBJS)</span> : <span class="variable">$(OBJDIRS)</span>/%.o : %.c</span><br><span class="line">	<span class="variable">$(CC)</span> <span class="variable">$(CFLAGS)</span> -c <span class="variable">$(INCLUDE)</span> <span class="variable">$&lt;</span>  -o <span class="variable">$@</span> </span><br><span class="line">	</span><br><span class="line"><span class="comment">#============================================================================#	</span></span><br><span class="line"><span class="meta"><span class="keyword">.PHONY</span>: clean clean_o</span></span><br><span class="line"><span class="comment"># 删除所有编译链接生成的文件命令</span></span><br><span class="line"><span class="section">clean: clean_o</span></span><br><span class="line">	@rm -vf <span class="variable">$(TARGET)</span></span><br><span class="line"></span><br><span class="line"><span class="comment"># 删除所有的 .o 文件命令</span></span><br><span class="line"><span class="section">clean_o:</span></span><br><span class="line">	@rm -vf <span class="variable">$(COBJS)</span></span><br><span class="line"></span><br><span class="line"><span class="section">printf:</span></span><br><span class="line">	@echo <span class="string">&quot;CFLAGS    = <span class="variable">$(CFLAGS)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;INCDIRS   = <span class="variable">$(INCDIRS)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;SRCDIRS   = <span class="variable">$(SRCDIRS)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;INCLUDE   = <span class="variable">$(INCLUDE)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;CFILES    = <span class="variable">$(CFILES)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;CFILENDIR = <span class="variable">$(CFILENDIR)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;COBJS     = <span class="variable">$(COBJS)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;OBJS      = <span class="variable">$(OBJS)</span>&quot;</span></span><br><span class="line">	@echo <span class="string">&quot;VPATH     = <span class="variable">$(VPATH)</span>&quot;</span></span><br><span class="line"></span><br></pre></td></tr></table></figure>
              </div>
            </details>

<h2 id="4-main-c"><a href="#4-main-c" class="headerlink" title="4. main.c"></a><font size=3>4. main.c</font></h2><details class="folding-tag" blue><summary> 点击查看详情 </summary>
              <div class='content'>
              <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;stdio.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&quot;seqlist.h&quot;</span></span></span><br><span class="line"></span><br><span class="line"><span class="comment">/* 测试函数实现 */</span></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_insert</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">1</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">3</span>, <span class="number">2</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">4</span>, <span class="number">2</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">5</span>, <span class="number">2</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_clear</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">3</span>, <span class="number">0</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	seqlist_clear(L);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_selist_delete</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">3</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	seqlist_delete(L, <span class="number">1</span>);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	seqlist_delete(L, <span class="number">5</span>);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_empty</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;list_empty(L) = %d\n&quot;</span>, seqlist_empty(L));</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;list_empty(L) = %d\n&quot;</span>, seqlist_empty(L));</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_length</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;seqlist_length(L) = %d\n&quot;</span>, seqlist_length(L));</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;seqlist_length(L) = %d\n&quot;</span>, seqlist_length(L));</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_locate</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line"></span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">3</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;list_locate(L, 1) = %d\n&quot;</span>, seqlist_locate(L, <span class="number">1</span>));</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;list_locate(L, 5) = %d\n&quot;</span>, seqlist_locate(L, <span class="number">5</span>));</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_delete_duplicate</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L;</span><br><span class="line">	L = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line"></span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">1</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">1</span>, <span class="number">2</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">2</span>, <span class="number">3</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">3</span>, <span class="number">4</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">4</span>, <span class="number">5</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">4</span>, <span class="number">6</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">5</span>, <span class="number">7</span>);</span><br><span class="line">	seqlist_insert(L, <span class="number">6</span>, <span class="number">8</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_show(L);</span><br><span class="line">	seqlist_delete_duplicate(L);</span><br><span class="line">	seqlist_show(L);</span><br><span class="line"></span><br><span class="line">	seqlist_free(L);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> <span class="title function_">test_seqlist_merge</span><span class="params">()</span></span><br><span class="line">&#123;</span><br><span class="line">	_seqlistlink L1;</span><br><span class="line">	_seqlistlink L2;</span><br><span class="line"></span><br><span class="line">	L1 = seqlist_create();</span><br><span class="line">	L2 = seqlist_create();</span><br><span class="line">	<span class="keyword">if</span> (L1 == <span class="literal">NULL</span>|| L2 == <span class="literal">NULL</span>) <span class="keyword">return</span>;</span><br><span class="line">	seqlist_insert(L1, <span class="number">1</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L1, <span class="number">2</span>, <span class="number">1</span>);</span><br><span class="line">	seqlist_insert(L1, <span class="number">3</span>, <span class="number">2</span>);</span><br><span class="line">	seqlist_insert(L1, <span class="number">4</span>, <span class="number">3</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_insert(L2, <span class="number">4</span>, <span class="number">0</span>);</span><br><span class="line">	seqlist_insert(L2, <span class="number">5</span>, <span class="number">1</span>);</span><br><span class="line">	seqlist_insert(L2, <span class="number">6</span>, <span class="number">2</span>);</span><br><span class="line">	seqlist_insert(L2, <span class="number">7</span>, <span class="number">3</span>);</span><br><span class="line"></span><br><span class="line">	seqlist_show(L1);</span><br><span class="line">	seqlist_show(L2);</span><br><span class="line">	<span class="built_in">printf</span>(<span class="string">&quot;====================\n&quot;</span>);</span><br><span class="line">	seqlist_merge(L1, L2);</span><br><span class="line">	seqlist_show(L1);</span><br><span class="line">	seqlist_show(L2);</span><br><span class="line"></span><br><span class="line">	seqlist_free(L1);</span><br><span class="line">	seqlist_free(L2);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">int</span> <span class="title function_">main</span><span class="params">(<span class="type">int</span> argc, <span class="type">char</span> *argv[])</span></span><br><span class="line">&#123;</span><br><span class="line">	<span class="comment">// test_seqlist_insert();</span></span><br><span class="line">	<span class="comment">// test_seqlist_clear();</span></span><br><span class="line">	<span class="comment">// test_selist_delete();</span></span><br><span class="line">	<span class="comment">// test_seqlist_empty();</span></span><br><span class="line">	<span class="comment">// test_seqlist_length();</span></span><br><span class="line">	<span class="comment">// test_seqlist_locate();</span></span><br><span class="line">	<span class="comment">// test_seqlist_delete_duplicate();</span></span><br><span class="line">	test_seqlist_merge();</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
              </div>
            </details>


    </div>

    
    
    

    <footer class="post-footer">




    <div>
        
            <div style="text-align:center;color: #ccc;font-size:14px;">
            ----------本文结束
            <i class="fas fa-fan fa-spin" style="color: #FF1493; font-size: 1rem"></i>
            感谢您的阅读----------
            </div>
        
    </div>





  
  <div class="my_post_copyright"> 
    <p><span>文章标题:</span><a href="/post/e29c3a2f.html">LV03-04-数据结构-线性表-顺序表操作</a></p>
    <p><span>文章作者:</span><a href="/" title="欢迎访问 《苏木》 的学习笔记">苏木</a></p>
    <p><span>发布时间:</span>2022年04月25日 - 09:40</p>
    <p><span>最后更新:</span>2025年06月14日 - 00:25</p>
    <p><span>原始链接:</span><a href="/post/e29c3a2f.html" title="LV03-04-数据结构-线性表-顺序表操作">https://sumumm.github.io/post/e29c3a2f.html</a></p>
    <p><span>许可协议:</span><i class="fab fa-creative-commons"></i> <a rel="license" href= "https://creativecommons.org/licenses/by-nc-nd/4.0/" target="_blank" title="Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)">署名-非商业性使用-禁止演绎 4.0 国际</a> 转载请保留原文链接及作者。</p>  
  </div>
  


          <div class="post-tags">
              <a href="/tags/LV03-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/" rel="tag"><i class="fa fa-tag"></i> LV03-数据结构</a>
          </div>

        

          <div class="post-nav">
            <div class="post-nav-item">
                <a href="/post/1b380a96.html" rel="prev" title="LV03-05-数据结构-线性表-单链表基础">
                  <i class="fa fa-angle-left"></i> LV03-05-数据结构-线性表-单链表基础
                </a>
            </div>
            <div class="post-nav-item">
                <a href="/post/eee19c55.html" rel="next" title="LV03-03-数据结构-线性表-顺序表基础">
                  LV03-03-数据结构-线性表-顺序表基础 <i class="fa fa-angle-right"></i>
                </a>
            </div>
          </div>
    </footer>
  </article>
</div>






</div>
  </main>

  <footer class="footer">
    <div class="footer-inner">

  <div class="copyright">
    &copy; 2017 – 
    <span itemprop="copyrightYear">2025</span>
    <span class="with-love">
      <i class="fa fa-heart"></i>
    </span>
    <span class="author" itemprop="copyrightHolder">苏木</span>
  </div>
<div class="wordcount">
  <span class="post-meta-item">
    <span class="post-meta-item-icon">
      <i class="fa fa-chart-line"></i>
    </span>
      <span>站点总字数：</span>
    <span title="站点总字数">3.7m</span>
  </span>
  <span class="post-meta-item">
    <span class="post-meta-item-icon">
      <i class="fa fa-coffee"></i>
    </span>
      <span>站点阅读时长 &asymp;</span>
    <span title="站点阅读时长">225:26</span>
  </span>
</div>




    <span id="sitetime"></span>
    <script defer language=javascript>
        function siteTime()
        {
            window.setTimeout("siteTime()", 1000);
            var seconds = 1000;
            var minutes = seconds * 60;
            var hours = minutes * 60;
            var days = hours * 24;
            var years = days * 365;
            var today = new Date();
            var todayYear = today.getFullYear();
            var todayMonth = today.getMonth()+1;
            var todayDate = today.getDate();
            var todayHour = today.getHours();
            var todayMinute = today.getMinutes();
            var todaySecond = today.getSeconds();
            /*==================================================
            Date.UTC() -- 返回date对象距世界标准时间(UTC)1970年1月1日午夜之间的毫秒数(时间戳)
            year        - 作为date对象的年份，为4位年份值
            month       - 0-11之间的整数，做为date对象的月份
            day         - 1-31之间的整数，做为date对象的天数
            hours       - 0(午夜24点)-23之间的整数，做为date对象的小时数
            minutes     - 0-59之间的整数，做为date对象的分钟数
            seconds     - 0-59之间的整数，做为date对象的秒数
            microseconds - 0-999之间的整数，做为date对象的毫秒数
            ==================================================*/
            var t1 = Date.UTC(2017, 
                              5, 
                              19, 
                              0, 
                              0, 
                              0); //北京时间
            var t2 = Date.UTC(todayYear,todayMonth,todayDate,todayHour,todayMinute,todaySecond);
            var diff = t2-t1;
            var diffYears = Math.floor(diff/years);
            var diffDays = Math.floor((diff/days)-diffYears*365);
            var diffHours = Math.floor((diff-(diffYears*365+diffDays)*days)/hours);
            var diffMinutes = Math.floor((diff-(diffYears*365+diffDays)*days-diffHours*hours)/minutes);
            var diffSeconds = Math.floor((diff-(diffYears*365+diffDays)*days-diffHours*hours-diffMinutes*minutes)/seconds);
            document.getElementById("sitetime").innerHTML="已在这里 "+diffYears+" 年 "+diffDays+" 天 "+diffHours+" 小时 "+diffMinutes+" 分钟 "+diffSeconds+" 秒";
        }
        siteTime();
    </script>



    </div>
  </footer>

  
  <div class="back-to-top" role="button" aria-label="返回顶部">
    <i class="fa fa-arrow-up fa-lg"></i>
    <span>0%</span>
  </div>
  <div class="reading-progress-bar"></div>

<noscript>
  <div class="noscript-warning">Theme NexT works best with JavaScript enabled</div>
</noscript>


  
  <script src="https://cdnjs.cloudflare.com/ajax/libs/animejs/3.2.1/anime.min.js" integrity="sha256-XL2inqUJaslATFnHdJOi9GfQ60on8Wx1C2H8DYiN1xY=" crossorigin="anonymous"></script>
  <script src="https://cdnjs.cloudflare.com/ajax/libs/next-theme-pjax/0.6.0/pjax.min.js" integrity="sha256-vxLn1tSKWD4dqbMRyv940UYw4sXgMtYcK6reefzZrao=" crossorigin="anonymous"></script>
  <script src="https://cdnjs.cloudflare.com/ajax/libs/fancyapps-ui/5.0.28/fancybox/fancybox.umd.js" integrity="sha256-ytMJGN3toR+a84u7g7NuHm91VIR06Q41kMWDr2pq7Zo=" crossorigin="anonymous"></script>
  <script src="https://cdnjs.cloudflare.com/ajax/libs/lozad.js/1.16.0/lozad.min.js" integrity="sha256-mOFREFhqmHeQbXpK2lp4nA3qooVgACfh88fpJftLBbc=" crossorigin="anonymous"></script>
<script src="/js/comments.js"></script><script src="/js/utils.js"></script><script src="/js/motion.js"></script><script src="/js/next-boot.js"></script><script src="/js/pjax.js"></script>

  <script src="https://cdnjs.cloudflare.com/ajax/libs/hexo-generator-searchdb/1.4.1/search.js" integrity="sha256-1kfA5uHPf65M5cphT2dvymhkuyHPQp5A53EGZOnOLmc=" crossorigin="anonymous"></script>
<script src="/js/third-party/search/local-search.js"></script>




  <script src="/js/third-party/fancybox.js"></script>

  <script src="/js/third-party/pace.js"></script>


  




  

  <script class="next-config" data-name="enableMath" type="application/json">false</script><script class="next-config" data-name="mathjax" type="application/json">{"enable":true,"tags":"none","js":{"url":"https://cdnjs.cloudflare.com/ajax/libs/mathjax/3.2.2/es5/tex-mml-chtml.js","integrity":"sha256-MASABpB4tYktI2Oitl4t+78w/lyA+D7b/s9GEP0JOGI="}}</script>
<script src="/js/third-party/math/mathjax.js"></script>


 
        <div id="click-show-text"
            data-mobile = false
            data-text = 富强,民主,文明,和谐,自由,平等,公正,法制,爱国,敬业,诚信,友善
            data-fontsize = 15px
            data-random= false>
        </div>
       

      
        <script async src=https://cdn.jsdelivr.net/npm/hexo-next-mouse-effect@latest/click/showText.js></script>
      

      
    




    <script async src="/js/fancybox_param.js"></script>





<!-- APlayer本体 -->



</body>
</html>
